A sequence of weakly monotonic automata with increasing level

A Sequence of Weakly Monotonic Automata with Increasing Level

In this paper, we exhibit a sequence of strongly connected aperiodic weakly monotonic automata, whose level increases with the number of states. Mathematics Subject Classification: 20M35, 68Q45, 20M07

Timed Automata with Monotonic Activities

Monotonic Rewriting Automata with a Restart Operation

We introduce a hierarchy of monotonic rewriting automata with a restart operation and show that its deterministic version collapses in a sequence of characterizations of deterministic context-free languages. The nondeterministic version of it gives a proper hierarchy of classes of languages with the class of context-free languages on the top.

Weakly Monotonic Propagators

Today’s models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models do not comply with reality: today’s constraint programming systems actually use non-monotonic propagators. This paper introduces the first realistic model of constraint propagation by assuming a propagator to be weakly monotonic (co...

Duration Calculus of Weakly Monotonic Time

We extend Duration Calculus to a logic which allows description of Discrete Processes where several steps of computation can occur at the same time point. The resulting logic is called Duration Calculus of Weakly Monotonic Time (WDC). It allows effects such as true synchrony and digitisation to be modelled. As an example of this, we formulate a novel semantics of Timed CSP assuming that the com...